منابع مشابه
The Farthest Spatial Skyline Queries
Pareto-optimal objects are favored as each of such objects has at least one competitive edge against all other objects, or “not dominated.” Recently, in the database literature, skyline queries have gained attention as an effective way to identify such pareto-optimal objects. In particular, this paper studies the pareto-optimal objects in perspective of facility or business locations. More spec...
متن کاملFarthest-Polygon Voronoi Diagrams
Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log n) time algorithm to compute it. We also prove a number of structural properties of this ...
متن کاملNetwork Farthest-Point Diagrams
Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network distance. Within this metric space, we study farthest points. We introduce network farthest-point diagrams, which capture how the farthest points—and the distan...
متن کاملThe Farthest Point Delaunay Triangulation Minimizes Angles
We show that the planar dual to the Euclidean farthest point Voronoi diagram for the set of vertices of a convex polygon has the lexicographic minimum possible sequence of triangle angles, sorted from sharpest to least sharp. As a consequence, the sharpest angle determined by three vertices of a convex polygon can be found in linear time.
متن کاملThe Mazur Intersection Property and Farthest Points
K. S. Lau had shown that a reflexive Banach space has the Mazur Intersection Property (MIP) if and only if every closed bounded convex set is the closed convex hull of its farthest points. In this work, we show that in general this latter property is equivalent to a property stronger than the MIP. As corollaries, we recapture the result of Lau and characterize the w*-MIP in dual of RNP spaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1902
ISSN: 0028-0836,1476-4687
DOI: 10.1038/067175a0